Conflict-Free Electric Vehicle Routing Problem with Capacitated Charging Stations and Partial Recharge
نویسندگان
چکیده
The adoption of electric vehicles (EVs) grows in rapid fashion in the transportation industry. However, limited battery capacity of EVs and the lack of charging facilities become challenges to obtain efficient route plans. In this paper, we propose a variant of electric vehicle routing problems considering the limited charging capacity at each station and the possibility of strategic partial recharging. A heuristic method, based on variable neighborhood search and tabu search, with simple charging time adjustment processes is presented to solve large instances of the problem. The proposed capacitated E-VRP model is tested with small size instances with a commercial optimization solver, while the heuristic method is implemented on both small and large instances. The main conclusion is that the battery capacity of the EVs and the number of chargers can significantly affect the total traveled distance.
منابع مشابه
A mathematical model for the electric vehicle routing with time windows considering queuing system at charging stations and alternative paths
Due to many damages that human activities have imposed on the environment, authorities, manufacturers, and industry owners have taken into account the development of supply chain more than ever. One of the most influential and essential human activities in the supply chain are transportation which green vehicles such as electric vehicles (EVs) are expected to generate higher economic and enviro...
متن کاملShortest path navigation algorithm for driverless plug-in electric vehicles
Driverless plug-in electric vehicles (DPEVs) have attracted a growing attention in transport engineering due to their low environmental impact and increased level of automation. When compared to regular internal combustion engine vehicles, DPEVs have two characteristics: 1) DPEVs require a higher frequency of recharge operations; 2) DPEVs are controlled by predetermined intelligent algorithms, ...
متن کاملExact Algorithms for Electric Vehicle-Routing Problems with Time Windows
Effective route planning for battery electric commercial vehicle (ECV) fleets has to take into account their limited autonomy and the possibility of visiting recharging stations during the course of a route. In this paper, we consider four variants of the electric vehicle-routing problem with time windows: (i) at most a single recharge per route is allowed, and batteries are fully recharged on ...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملSolving a Bi-Objective Multi-Product Vehicle Routing Problem with Heterogeneous Fleets under an Uncertainty Condition
This paper presents a novel bi-objective multi-product capacitated vehicle routing problem with uncertainty in demand of retailers and volume of products (UCVRP) and heterogeneous vehicle fleets. The first of two conflict fuzzy objective functions is to minimize the cost of the used vehicles, fuel consumption for full loaded vehicles and shortage of products. The second ...
متن کامل